Algorithms for DNA Restri tion Mapping

A Data Centri Prote tion Ar hite ture For Restri ting A tiveDataSotiris

Hardware/Software Co-Design Using Functional Languages

In previous work we have developed and prototyped a silion ompiler whi h translates a fun tional language (SAFL) into hardware. The te hniques we use require the restri tion (stati allo atability) that all re ursive alls are in a tail ontext. Here we extend this work, translating a fun tional language with general re ursion by mapping some fun tions dire tly to hardware and others to instru tio...

Óò×øöù Blockinøøòò È××ùùó¹êêòòóñ Èöñùøøøøóò× Ûûøø Èöö× Blockinööö

We show how to onstru t pseudo-random permutations that satisfy a ertain y le restri tion, for example that the permutation be y li ( onsisting of one y le ontaining all the elements) or an involution (a self-inverse permutation) with no xed points. The onstru tion an be based on any (unrestri ted) pseudo-random permutation. The resulting permutations are de ned su in tly and their evaluation a...

Approximating integer programs with positive right-hand sides

1 Department of Computer and Information S ien e, Linköpings universitet, SE-581 83 Linköping, Sweden 2 É ole polyte hnique, Laboratoire d'informatique (LIX), 91128 Palaiseau Cedex, Fran e Abstra t. We study minimisation of integer linear programs with positive right-hand sides. We show that su h programs an be approximated within the maximum absolute row sum of the onstraint matrix A whenever ...

Simulation Logic, Applets and Compositional Verification

We present a ompositional veri ation method for ontrol ow based safety properties of smart ard applets. Our method rests on a lose orresponden e between transition system models ordered by simulation and Hennessy-Milner logi extended with simultaneous greatest xed points. We show that simulation an be hara terised logi ally and, vi e versa, logi al satisfa tion an be represented behaviourally b...